Modified Dijkstra’s Shortest Path Algorithm
نویسنده
چکیده
Roads play a vital role to the people live in different places and, from day to day, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediums used most frequently for travel and transportation. The computation of a shortest path between different locations appears to be a key problem in the road networks. The wide range of applications was introduced to overcome the problem by developing various shortest path algorithms. Even now the problem still persists to find the shortest path on road networks. To overcome the shortest path problem a new algorithm namely, Modified Dijkstra’s Shortest Path (MDSP) algorithm using multiple parameters is proposed in this paper. The proposed algorithm is compared with the existing algorithm to prove its efficiency.
منابع مشابه
Modification of Dijkstra’s Algorithm for Safest and Shortest Path during Emergency Evacuation
Intelligent autonomous evacuation navigation (AEN) system manages to solve wayfinding problems during emergency evacuation, especially for those who are not familiar with the building. AEN system is expected to provide independent evacuation navigation through the dynamic signage, which helps occupants navigate to the safest and shortest path towards the nearest exit. It uses modified Dijkstra’...
متن کاملFinding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کاملExploring Graph Partitioning for Shortest Path Queries on Road Networks
Computing the shortest path between two locations in a road network is an important problem that has found numerous applications. The classic solution for the problem is Dijkstra’s algorithm [1]. Although simple and elegant, the algorithm has proven to be inefficient for very large road networks. To address this deficiency of Dijkstra’s algorithm, a plethora of techniques that introduce some pr...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Dijkstra’s Algorithm and L-concave Function Maximization
Dijkstra’s algorithm is a well-known algorithm for the single-source shortest path problem in a directed graph with nonnegative edge length. We discuss Dijkstra’s algorithm from the viewpoint of discrete convex analysis, where the concept of discrete convexity called L-convexity plays a central role. We observe first that the dual of the linear programming (LP) formulation of the shortest path ...
متن کاملDijkstra Shortest Path Algorithm using Global Positioning System
Dijkstra’s Algorithm is used to find the shortest path from one node to another node in a graph.Dijkstra’s algorithm is also known as a single source shortest path algorithm. It is applied only on positive weights. In this paper, Global Positioning System is used for adding a new functionality in Dijkstra’s algorithm. In this paper, using Global Positioning System the position parameter is adde...
متن کامل